A New Domain Decomposition Approach Suited for Grid Computing
نویسندگان
چکیده
In this paper, we describe a new kind of domain decomposition strategy for solving linear elliptic boundary-value problems. It outperforms the traditional ones in complex and heterogeneous networks like those for grid computing. Such a strategy consists of a hybrid numerical scheme based on a probabilistic method along with a domain decomposition, and full decoupling can be accomplished. While the deterministic approach is strongly affected by intercommunication among the hosts, the probabilistic method is scalable as the number of subdomains, i.e., the number of processors involved, increases. This fact is clearly illustrated by an example, even operating in a grid environment.
منابع مشابه
Multiscale mass conservative domain decomposition preconditioners for elliptic problems on irregular grids
Multiscale methods can in many cases be viewed as special types of domain decomposition preconditioners. The localisation approximations introduced within the multiscale framework are dependent upon both the heterogeneity of the reservoir and the structure of the computational grid. While previous works on multiscale control volume methods have focused on heterogeneous elliptic problems on regu...
متن کاملDfg-forschergruppe \spc" Fakultt at F Ur Mathematik Parallelization of Multi-grid Methods Based on Domain Decomposition Ideas
In the paper, the parallelization of multi-grid methods for solving second-order elliptic boundary value problems in two-dimensional domains is discussed. The parallelization strategy is based on a non-overlapping domain decomposition data structure such that the algorithm is well-suited for an implementation on a parallel machine with MIMD architecture. For getting an algorithm with a good par...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملStrip Decomposition Parallelization of Fast Direct Poisson Solver on a 3D Cartesian Staggered Grid
A strip domain decomposition parallel algorithm for fast direct Poisson solver is presented on a 3D Cartesian staggered grid. The parallel algorithm follows the principles of sequential algorithm for fast direct Poisson solver. Both Dirichlet and Neumann boundary conditions are addressed. Several test cases are likewise addressed in order to shed light on accuracy and efficiency in the strip do...
متن کاملNumerical Implementation of Overlapping Balancing Domain Decomposition Methods on Unstructured Meshes
The Overlapping Balancing Domain Decomposition (OBDD) methods can be considered as an extension of the Balancing Domain Decomposition (BDD) methods to the case of overlapping subdomains. This new approach, has been proposed and studied in [4, 3]. In this paper, we will discuss its practical parallel implementation and present numerical experiments on large unstructured meshes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006